State space reduction by non-standard semantics for deadlock analysis
نویسندگان
چکیده
منابع مشابه
State Space Reduction by Non-Standard Semantics for Deadlock Analysis
In recent years many techniques have been developed for automatically verifying concurrent systems and most of them are based on the representation of the concurrent system by means of a transition system. State explosion is one of the most serious problems of this approach: often the prohibitive number of states renders the veriication ineecient and, in some cases, impossible. We propose a met...
متن کاملFrom Standard to Non-Standard Semantics by Semantics Modifiers
An approach for systematically modifying the semantics of programming languages by semantics modifiers is described. Semantics modifiers are a class of programs that allow the development of general and reusable “semantics components”. Language independence is achieved through the interpretive approach: an interpreter serves as a mediator between the new language and the language for which the ...
متن کاملNon Interleaving Semantics for CCS and Fast Deadlock Detection
This paper proposes a non interleaving semantics for CCS and de nes a class of CCS compositions for which interleaving and non interleaving se mantics are equivalent It also presents a fast software tool for analysis of CCS compositions under non interleaving semantics The tool employs Petri net techniques with multiple transition rings Contact jacek cse unsw oz au
متن کاملA Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملStatic Analysis for State-Space Reduction of Polygonal Hybrid Systems
Polygonal hybrid systems (SPDI) are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions. The reachability problem as well as the computation of certain objects of the phase portrait, namely the viability, controllability and invariance kernels, for such systems is decidable. In this paper we show how to compute another object of an SPDI ph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1998
ISSN: 0167-6423
DOI: 10.1016/s0167-6423(97)00017-8